Efficient Reachability Ratio Computation for 2-Hop Labeling Scheme

Fast Computation of Reachability Labeling for Large Graphs

The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic analyzing, Web navigation, semantic web, chemical informatics and bio-informatics systems, and computer vision. A graph reachability query, as one of the primary tasks, is to find whether two given data objects, u an...

An Efficient Computation of Reachability Labeling for Social Networking Using Graph Pattern Mining: an Application of Data Mining

Graphs form a powerful modeling tool to represent complex relationships among objects in an effective manner. Graph pattern matching is one of the areas of data mining where the data is stored in the form of graphs and the set of tuples that match a user-given graph pattern are extracted. For finding the set of matching tuples faster, all the possible paths in the large directed graph, i.e., tr...

Symbolic computation of reachability

A Flexible Clustering and Scheduling Scheme for Efficient Parallel Computation

Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and reduce problem execution times. In this paper we present a novel approach where clustering and scheduling of tasks can be tuned to achieve maximal speedup or efficiency. The proposed scheme is based on the relation betwe...

Reachability computation for hybrid systems with Ariadne

Ariadne is an in-progress open environment to design algorithms for computing with hybrid automata, that relies on a rigorous computable analysis theory to represent geometric objects, in order to achieve provable approximation bounds along the computations. In this paper we discuss the problem of reachability analysis of hybrid automata to decide safety properties. We describe in details the a...